Multi-agent System Models for Distributed Services Scheduling

This thesis investigates the computational and modeling issues involved with developing solutions for distributed service scheduling problems. Compared with traditional manufacturing scheduling, service scheduling poses additional challenges due to the significant customer involvement in service processes. The first challenge is that the service scheduling environment is a distributed environment in which scheduling-related information is scattered among individual identities, such as service providers and customers. The second challenge is that the service scheduling environment is a dynamic environment. Uncertainty in customer demand, customer cancellations and no-shows make the scheduling of services a complex dynamic process. Service scheduling has to be robust and prepared to accommodate any contingencies caused by customer involvement in service production. The third challenge concerns customers’ private information. To compute optimal schedules, ideally, the scheduler should know the complete customer availability and preference information within the scheduling horizon. However, customers may act strategically to protect their private information. Therefore, service scheduling systems should be designed so that they are able to elicit enough of a customer’s private information that will make it possible to compute high quality schedules. The fourth challenge is that in a service scheduling environment, the objectives are complicated and they may even be in opposition. The distributed service scheduling environment enables each agent to have their own scheduling objectives. The objectives of these agents can vary from one to another. In addition to multiple objectives, since agents are self-interested, they are likely to behave strategically to achieve their own objectives without considering the global objectives of the system. Existing approaches usually deal with only a part of the challenges in a specific service domain. There is a need for general problem formulations and solutions that address service scheduling challenges in a comprehensive framework. In this thesis, I propose an integrated service scheduling framework for the general service scheduling problem. The proposed framework uses iterative auction as the base mechanism to tackle service scheduling challenges in distributed and dynamic environments. It accommodates customer’s private information by providing appropriate incentives to customers and it has the potential to accommodate dynamic events. This framework integrates customers’ preferences with the allocation of a provider’s capacity through multilateral negotiation between the provider and its customers. The framework can accommodate both price-based commercial settings and non-commercial service settings. Theoretical and experimental results are developed to verify the effectiveness of the proposed framework. The application of the framework to the mass customization of services and to appointment scheduling are developed to demonstrate the applicability of the general framework to specific service domains. A web-based prototype is designed and implemented to evaluate the scalability of the approach in a distributed environment

Service customization under capacity constraints: an auction-based model

In mass customization, companies strive to enhance customer value by providing products and services that are approximate to customers’ needs. A company’s strategy of allocating its limited capacity to meeting diverse customer requirements directly impact customer perceived value in terms of available options, cost, and schedule. Proposed in this paper is an auction-based mass customization model for solving the problem of service customization under capacity constraints (SCCC). The proposed model integrates customers’ customization decision making with the allocation of company’s capacity through multilateral negotiation between the company and its customers. The negotiation is conducted through a combinatorial iterative auction designed to maximize the overall customer value given limited capacity. The auction is incentive-compatible in the sense that customers will follow the prescribed myopic best-response bidding strategy. Experimental results indicate that customization solutions computed by the proposed model are very close to the optimal one. Revenue performance is also adequate when there is sufficient competition in the market

On the tradeoff between privacy and efficiency: A bidding mechanism for scheduling non-commercial services

Services providers, such as public healthcare systems and government agencies, are under tremendous pressure to reduce costs and improve service quality. Scheduling is an important managerial component which has considerable impact on both the costs and quality of services. Service providers need customers’ availability information to improve resource utilization. On the other hand, customers may be of “two minds” about communicating their private information. While communicating certain amount of availability might be necessary in order to obtain preferred schedules, too much communication place a potential cost due to privacy loss. In this paper, we present a bidding-based mechanism which aims at generating high quality schedules and, at the same time, protecting customers’ privacy. We show that, under the proposed bidding procedure, myopic bidding is the dominant strategy for customers. We also evaluate the privacy and efficiency performance of the proposed mechanism through a computational study

Agent-Based System Design for Service Process Scheduling: Challenges, Approaches and Opportunities

Compared with traditional manufacturing scheduling, service process scheduling poses additional challenges attributable to the significant customer involvement in service processes. In services, there are typically no inventoried products, which make the service provider's capacity more sensitive to dynamic changes. Service process scheduling objectives are also more complicated due to the consideration of customer preferences, customer waiting costs and human resource costs. After describing the Unified Services Theory and analysing its scheduling implications, this paper reviews the research literature on service process scheduling system design with a particular emphasis on agent-based approaches. Major issues in agent-based service process scheduling systems design are discussed and research opportunities are identified. The survey of the literature reveals that despite of many domain-specific designs in agent-based service process scheduling, there is a lack of general problem formulations, classifications, solution frameworks, and test beds. Constructing these general models for service process scheduling system design will facilitate the collaboration of researchers in this area and guide the effective development of integrated service process scheduling systems

Impairment of entorhinal cortex network activity in Alzheimer’s disease

The entorhinal cortex (EC) stands out as a critical brain region affected in the early phases of Alzheimer’s disease (AD), with some of the disease’s pathological processes originating from this area, making it one of the most crucial brain regions in AD. Recent research highlights disruptions in the brain’s network activity, characterized by heightened excitability and irregular oscillations, may contribute to cognitive impairment. These disruptions are proposed not only as potential therapeutic targets but also as early biomarkers for AD. In this paper, we will begin with a review of the anatomy and function of EC, highlighting its selective vulnerability in AD. Subsequently, we will discuss the disruption of EC network activity, exploring changes in excitability and neuronal oscillations in this region during AD and hypothesize that, considering the advancements in neuromodulation techniques, addressing the disturbances in the network activity of the EC could offer fresh insights for both the diagnosis and treatment of AD